解含非线性源项的变分不等式问题的非重叠区域分解法

１．引言 近十几年来,变分不等式区域分解算法方面的研究取得了很多成果．特别是重叠型区域分解法方面的研究更是硕果累累,读者可参阅［１－８］等文献．而非重叠型区域分解法方面的研究目前相关结论不多,只有文献［９］针对线性算子单障碍问题提出了一类多子域非重叠区域分解算法（该方法的基本思想来自于工程中早已运用的子结构法）,证明了它的收敛性,并给出了收敛速度分析． 本文将针对含非线性源项的变分不等式问题提出一类多子域非重叠区域分解算法,并给出其收敛性和收敛速度分析． ２．问题及其有限元逼近 设ｎ为ＲＺ中有界凸多…     

具有二项式型多项式下三角矩阵的性质

n 1阶下三角方阵Ln[x]定义为:(Ln[x])ij=(?)i-j(x)l(i,j)(如果i≥j),否则为0,且满足条件l(i,k)l(k,j)=l(i,j)(k-j i-j)和 ,即二项式型多项式函数矩阵.n 1阶方阵Ln定义为:当i≥j时,(Ln)ij=l(i,j),否则为0.本文研究了比Pascal函数矩阵及Lah矩阵更广泛的一类矩阵Ln[x]与Ln,得到了更一般的结果和一些组合恒等式.     

On Exponentially Shaped Josephson Junctions

The paper deals with a third order semilinear equation which characterizes exponentially shaped Josephson junctions in superconductivity. The initial-boundary problem with Dirichlet conditions is analyzed. When the source term F is a linear function, the problem is explicitly solved by means of a Fourier series with properties of rapid convergence. When F is nonlinear, appropriate estimates of this series allow to deduce a priori estimates, continuous dependence and asymptotic behaviour of the solution.     

具有一般学习效应的单机排序问题

在具有学习效应的环境下,由于机器重复加工相同或相似的工件,因此以后加工的工件的加工时间变小.本文研究新的更一般的学习效应:Dejong学习效应.我们证明单机最大完工时间问题,总完工时间问题和两类多目标问题是多项式时间可解的.     

Ap(φ)上Toeplitz算子的半换位子

本文给出加权Bergman空间A^p(φ)上具有界调和符号的Toeplitz算子的半换位子为零或为紧算子的一些充要条件.     

EXISTENCE OF POSITIVE SOLUTIONS FOR p-LAPLACIAN SINGULAR BOUNDARY VALUE PROBLEMS OF FUNCTIONAL DIFFERENTIAL EQUATION

In this paper, the boundary value problems of p-Laplacian functional differential equation are studied. By using a fixed point theorem in cones,some criteria for the existence of positive solutions are given.     

关于一些级数取整值问题的注记

利用Pell方程的理论,讨论了与广义Lucas数有关的一些级数的取整值问题.在一定条件下,解决了一些级数的取整值问题.     

树的第二个最大特征值

本文得到了边独立数为n且阶为2n+2的树的第二个最大特征值的精确上界,且给出了达到上界的所有的极树.     

凸体的p次径向平均体的几个性质

本文证明了凸体的p次径向平均体的线性不变性和椭球的p次径向平均体仍是椭球,并且获得了p次径向平均体相应于Blaschke-Santaló不等式的一个反向不等式．     

赋权图的w密度和w平衡性

The notion of w-density for the graphs with positive weights on vertices and nonnegative weights on edges is introduced. A weighted graph is called w-balanced if its w-density is no less than the w-density of any subgraph of it. In this paper,a good characterization of w-balanced weighted graphs is given. Applying this characterization ,many large w-balanced weighted graphs are formed by combining smaller ones. In the case where a graph is not w-balanced,a polynomial-time algorithm to find a subgraph of maximum w-density is proposed. It is shown that the w-density theory is closely related to the study of SEW(G,w) games.